Block designs and graph imbeddings
نویسندگان
چکیده
منابع مشابه
Theta Graph Designs
We solve the design spectrum problem for all theta graphs with 10, 11, 12, 13, 14 and 15 edges.
متن کاملCycles in the block-intersection graph of pairwise balanced designs
The focws of this thesis is to investigate certain graph theoretic propertir-s of a class of graphs \shicL arise from combinatorial design theory. The Itlock-i~~tc.rscc.tion graph of a pairwise balanced design has as its vertices tlw Mocks of tllc (hasign ;irici has as its edges precisely those pairs of blocks wliicll llrtvr. nori-cm~pty ilitc~rsc~c'ticm. These graphs have a particular local st...
متن کاملRamsey Graphs and Block Designs
This paper establishes a connection between a certain class of Ramsey numbers for graphs and the class of symmetric block designs admitting a polarity. The main case considered here relates the projective planes over Galois fields to the Ramsey numbers R(Ca, Kx „) = f(n). It is shown that, for 2 2 ' 2 2 every prime power q, f(q + 1) = q + q + 2, and f(q ) = q + q + 1.
متن کاملSome Block Designs Constructed from Resolvable Designs
LetD be a resolvable 2−(v, k, λ) design, andD′ be a 2−(v′, k′, λ′) design, such that v′ = v k . Further, let r and r′ be replication numbers of a point in D and D′, respectively. Shrikhande and Raghavarao proved that then there exists a 2 − (v′′, k′′, λ′′) design D′′, such that v′′ = v, k′′ = kk′ and λ′′ = r′λ + (r − λ)λ′. If D′ is resolvable, then D′′ is also resolvable. Applying this result, ...
متن کاملThickly-resolvable block designs
We show that the necessary divisibility conditions for the existence of a σ-resolvable BIBD(v, k, λ) are sufficient for large v. The key idea is to form an auxiliary graph based on an [r, k]-configuration with r = σ, and then edge-decompose the complete λ-fold graph K (λ) v into this graph. As a consequence, we initiate a similar existence theory for incomplete designs with index λ. ∗ Supported...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1978
ISSN: 0095-8956
DOI: 10.1016/0095-8956(78)90036-9